(xtra_lib/bzrintrp.c:204)
Prototype:
void BzrCrvInterp(RealType *Result, RealType *Input, int Size)
Description:
Blends the input points using the Interp array and puts the resulted
blended point in Result array. Input and Result array are of size Size.
Parameters:
Result: | Where the interpolated control points will be placed.
|
---|
Input: | Points to interpolate at node parameter values.
|
---|
Size: | Of control polygon.
|
---|
Returned Value:
Keywords:
interpolation
(xtra_lib/cnvxhull.c:61)
Prototype:
int ConvexHull(ConvexHullPoint *DTPts, int *NumOfPoints)
Description:
Convex Hull computation of a set of points. The Convex Hull is returned
in place, updating NumOfPoints.
Algorithm is based on two articles:
1. An Efficient Algorithm For Determining The convex Hull of a Finite Set.
By R.L. Graham, Information processing letters (1972) 132-133.
2. A Reevolution of an Efficient Algorithm For Determining The Convex Hull
of a Finite Planar Set. By K.R. Anderson, Information Processing
Letters, January 1978, Vol. 7, Num. 1, 53-55.
Parameters:
DTPts: | The set of point to compute their convex hull.
|
---|
NumOfPoints: | Number of points in set DTPts.
|
---|
Returned Value:
int: TRUE if successful, FALSE otherwise.
|
---|
Keywords:
(xtra_lib/nure_svd.c:277)
Prototype:
RealType SvdLeastSqr(RealType *A, RealType *x, RealType *b, int NData, int Nx)
Description:
Least square solves A x = b.
The vector X is of size Nx, vector b is of size NData and matrix A is
of size Nx by NData.
Uses singular value decomposition.
If A != NULL is SVD decomposition is computed, otherwise (A == NULL) a
solution is computed for the given b and is placed in x.
Parameters:
A: | The matrix of size Nx by NData.
|
---|
x: | The vector of sought solution of size Nx.
|
---|
b: | The vector of coefficients of size NData.
|
---|
NData, Nx: | Dimensions of input.
|
---|
Returned Value:
RealType: The reciprocal of the condition number, if A != NULL, zero
otherwise.
|
---|
Keywords:
singular value decomposition
linear systems